Distributed Algorithms for SCC Decomposition

Numerical solution of a system of fuzzy polynomial equations by modified Adomian decomposition method

In this paper, we present some efficient numerical algorithm for solving system of fuzzy polynomial equations based on Newton's method. The modified Adomian decomposition method is applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms.

Average distance and routing algorithms in the star-connected cycles interconnection network

The star-connected cycles (SCC) graph was recently proposed as an attractive interconnection network for parallel processing, using a star graph to connect cycles of nodes. This paper presents an analytical solution for the problem of the average distance of the SCC graph. We divide the cost of a route in the SCC graph into three components, and show that one of such components is affected by t...

A Hybrid MOEA/D-TS for Solving Multi-Objective Problems

In many real-world applications, various optimization problems with conflicting objectives are very common. In this paper we employ Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), a newly developed method, beside Tabu Search (TS) accompaniment to achieve a new manner for solving multi-objective optimization problems (MOPs) with two or three conflicting objectives. This i...

Biconjugate Decomposition Using ABS Algorithms

Multi-core SCC-Based LTL Model Checking

We investigate and improve the scalability of multi-core LTL model checking. Our algorithm, based on parallel DFS-like SCC decomposition, is able to efficiently decompose large SCCs on-the-fly, which is a difficult problem to solve in parallel. To validate the algorithm we performed experiments on a 64-core machine. We used an extensive set of well-known benchmark collections obtained from the ...